منابع مشابه
Dynamic benchmark targeting
We study decision making in complex discrete-time dynamic environments where Bayesian optimization is intractable. A decision maker is equipped with a finite set of benchmark strategies. She aims to perform similarly to or better than each of these benchmarks. Furthermore, she cannot commit to any decision rule, hence she must satisfy this goal at all times and after every history. We find such...
متن کاملBenchmark Generator for the IEEE WCCI-2014 Competition on Evolutionary Computation for Dynamic Optimization Problems Dynamic rotation peak benchmark generator (DRPBG) and Dynamic composition benchmark generator (DCBG)
Many realworld optimization problems are dynamic optimization problems (DOPs), where changes may occur over time regarding the objective function, decision variable, and constraints, etc. DOPs raise big challenges to traditional optimization methods as well as evolutionary algorithms (EAs). The last decade has witnessed increasing research efforts on handling dynamic optimization problems using...
متن کاملA Benchmark Generator for Dynamic Optimization
Almost all real-world problems are dynamic and as such not all problem instances are known a priori. Many strategies to deal with dynamic problems exist in the literature, however they are not fully tested on combinatorial problems due to the deficiency of benchmarks. This paper presents a benchmark generator that uses Genetic Algorithms to produce benchmark problems for the dynamic traveling s...
متن کاملDynaMark: A Benchmark for Dynamic Spatial Indexing
We propose a performance benchmark for dynamic spatial indexing that is directly geared towards Location-Based Services (LBS). A set of standard, realistic location trace les is used to measure the update and query performance of a spatial data management system. We de ne several query types relevant for LBS: proximity queries (range queries), k-nearest neighbor queries, and sorted-distance que...
متن کاملDynamic Function Optimization: The Moving Peaks Benchmark
Many practical, real-world applications have dynamic features. If the changes in the fitness function of an optimization problem are moderate, a complete restart of the optimization algorithm may not be warranted. In those cases, it is meaningful to apply optimization algorithms that can accommodate change. In the recent past, many researchers have contributed algorithms suited for dynamic prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 2017
ISSN: 0022-0531
DOI: 10.1016/j.jet.2017.02.004